f2(1810) as a triangle singularity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

unitarity triangle as one

The quark mixing matrix with manifest Cabibbo substructure and an angle of the unitarity triangle as one of its parameters Abstract The quark mixing matrix is parameterised such that its " Cabibbo substructure " is emphasised. One can choose one of the parameters to be an arbitrarily chosen angle of the unitarity triangle, for example the angle β (also called Φ 1).

متن کامل

A Triangle-Triangle Intersection Algorithm

The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...

متن کامل

Schwarz boundary problem on a triangle

In this paper, the Schwarz boundary value problem (BVP) for the inhomogeneous Cauchy-Riemann equation in a triangle is investigated explicitly. Firstly, by the technique of parquetingreflection and the Cauchy-Pompeiu representation formula a modified Cauchy-Schwarz representation formula is obtained. Then, the solution of the Schwarz BVP is explicitly solved. In particular, the boundary behavio...

متن کامل

A TAXICAB VERSION OF A TRIANGLE' S APOLLONIUS CIRCLE

One of the most famous problems of classical geometry is the Apollonius' problem asks construction of a circle which is tangent to three given objects. These objects are usually taken as points, lines, and circles. This well known problem was posed by Apollonius of Perga ( about 262 - 190 B.C.) who was a Greek mathematician known as the great geometer of ancient times after Euclid and Archimede...

متن کامل

A Fast Triangle-Triangle Intersection Test

This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used in, for example, collision detection algorithms.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review D

سال: 2017

ISSN: 2470-0010,2470-0029

DOI: 10.1103/physrevd.95.034004